On the Cayley Isomorphism Problem for Cayley Objects of Nilpotent Groups of Some Orders

نویسنده

  • Edward Dobson
چکیده

We give a necessary condition to reduce the Cayley isomorphism problem for Cayley objects of a nilpotent or abelian group G whose order satisfies certain arithmetic properties to the Cayley isomorphism problem of Cayley objects of the Sylow subgroups of G in the case of nilpotent groups, and in the case of abelian groups to certain natural subgroups. As an application of this result, we show that Zq×Zp×Zm is a CI-group with respect to digraphs, where q and p are primes with p2 < q and m is a square-free integer satisfying certain arithmetic conditions (but there are no other restrictions on q and p).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

On the Cayley Isomorphism Problem for a Digraph with 24 Vertices

In this paper we are mainly concerned with the Cayley isomorphism problem for groups containing Q8. We prove that the group Q8 × C3 is not a CI-group with respect to colour ternary relational structures. Further, we prove that the non-nilpotent group C3 nQ8 is not a CI-group with respect to graphs.

متن کامل

SOME GRAPH PARAMETERS ON THE COMPOSITE ORDER CAYLEY GRAPH

In this paper, the composite order Cayley graph Cay(G, S) is introduced, where G is a group and S is the set of all composite order elements of G. Some graph parameters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order Cayley graph of some certain groups. Moreover, the planarity of composite order Ca...

متن کامل

Isomorphisms of Cayley graphs on nilpotent groups

Let S be a finite generating set of a torsion-free, nilpotent group G. We show that every automorphism of the Cayley graph Cay(G;S) is affine. (That is, every automorphism of the graph is obtained by composing a group automorphism with multiplication by an element of the group.) More generally, we show that if Cay(G1;S1) and Cay(G2;S2) are connected Cayley graphs of finite valency on two nilpot...

متن کامل

On an inverse Cayley problem

Let G be a group. We will call G a group with Cayley data if we are given all three of the following: the underlying set G; the collection of all Cayley sets of G; and for each Cayley subset S of G, the corresponding Cayley graph Cay(G,S). Is it then possible, from the Cayley data, to reconstruct the binary operation of the group? Is it possible to determine the isomorphism class of the group? ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2014